Rewriting and Multisets in ρ-calculus and ELAN

نویسنده

  • Horatiu Cirstea
چکیده

The ρ-calculus is a new calculus that integrates in a uniform and simple setting first-order rewriting, λ-calculus and non-deterministic computations. The main design concept of the ρ-calculus is to make all the basic ingredients of rewriting explicit objects, in particular the notions of rule application and multisets of results. This paper describes the calculus from its syntax to its basic properties in the untyped case. The ρ-calculus embeds first-order conditional rewriting and λ-calculus and it can be used in order to give an operational semantics to the rewrite based language ELAN. We show how the set-like data structures are easily represented in ELAN and how this can be used in order to specify the Needham-Schroeder public-key protocol.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Higher-Order and First-Order Computation Using ρ-calculus: Towards a semantics of ELAN

The ρ-calculus permits to express in a uniform and simple way firstorder rewriting, λ-calculus and non-deterministic computations as well as their combination. In this paper, we present the main components of the ρ-calculus and we give a full first-order presentation of this rewriting calculus using an explicit substitution setting, called ρσ, that generalizes the λσ-calculus. The basic propert...

متن کامل

The rewriting calculus as a semantics to strategy application. Application to ELAN

Objects like rewrite rules and strategies are of very general use and interest in computer science. They are especially useful when modeling inference based systems like logical frameworks, theorem provers, constraint solvers, expert systems, transition systems. In order to formalize the concept of rule application, we have designed a calculus of explicit rule application called the rewritingor...

متن کامل

The Rewriting Calculus as a Semantics of ELAN

Rewriting techniques are now recognized as a fundamental concept in many areas of computer science including mechanized theorem proving and operational semantics of programming languages. From a conceptual as well as operational point of view, the notion of rewrite rule application is crucial. It leads immediately to the concept of rewriting strategy which fully defines the way several rules ar...

متن کامل

The rewriting calculus - Part II

The ρ-calculus integrates in a uniform and simple setting first-order rewriting, λ-calculus and nondeterministic computations. Its abstraction mechanism is based on the rewrite rule formation and its main evaluation rule is based on matching modulo a theory T . We have seen in the first part of this work the motivations, definitions and basic properties of the ρ-calculus. This second part is fi...

متن کامل

Term collections in λ and ρ - calculi

The ρ-calculus, also called the rewriting calculus, originally emerged from di erent motivations and from a di erent community than the λ-calculus. It was introduced to make explicit all the ingredients of rewriting such as rule application and result [CK01]. In ne the ρ-calculus provides an extension of the λ-calculus with additional concepts originating from rewriting and functional programin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004